1435B - A New Technique - CodeForces Solution


constructive algorithms implementation *1100

Please click on ads to support us..

Python Code:

import sys
from sys import stdin

tt = int(stdin.readline())

ANS = []
for loop in range(tt):

    n,m = map(int,stdin.readline().split())

    lis = [ list(map(int,stdin.readline().split())) for i in range(n) ]

    one = set()
    for i in range(n):
        one.add(lis[i][0])

    A = None
    for i in range(m):

        a = list(map(int,stdin.readline().split()))
        if a[0] in one:
            A = a

    rev = {}
    a = A

    for i in range(len(a)):
        rev[a[i]] = i

    
    nlis = []
    for x in lis:

        nlis.append( [rev[x[0]]] + x )

    nlis.sort()

    for i in nlis:
        ANS.append(" ".join(map(str,i[1:])))

print ("\n".join(ANS))


Comments

Submit
0 Comments
More Questions

1650C - Weight of the System of Nested Segments
1097A - Gennady and a Card Game
248A - Cupboards
1641A - Great Sequence
1537A - Arithmetic Array
1370A - Maximum GCD
149A - Business trip
34A - Reconnaissance 2
59A - Word
462B - Appleman and Card Game
1560C - Infinity Table
1605C - Dominant Character
1399A - Remove Smallest
208A - Dubstep
1581A - CQXYM Count Permutations
337A - Puzzles
495A - Digital Counter
796A - Buying A House
67A - Partial Teacher
116A - Tram
1472B - Fair Division
1281C - Cut and Paste
141A - Amusing Joke
112A - Petya and Strings
677A - Vanya and Fence
1621A - Stable Arrangement of Rooks
472A - Design Tutorial Learn from Math
1368A - C+=
450A - Jzzhu and Children
546A - Soldier and Bananas